Optimal Task Assignment in Distributed Systems through Greedy algorithm
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is well known to be NP-complete, except in a few special cases. Thus heuristics are used to obtain suboptimal solutions in reasonable amount of time. While a plethora of such heuristics have been documented in the literature, ...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملOptimal task assignment in heterogeneous distributed computing systems
exploit effective parallelism on a distributed system, tasks must be properly allocated to the processors. This problem, task assignment, is well-known to be NPhard in most cases.1 A task-assignment algorithm seeks an assignment that optimizes a certain cost function—for example, maximum throughput or minimum turnaround time. However, most reported algorithms yield suboptimal solutions. In gene...
متن کاملA hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited resource are satisfied. Most of the existing formulations for this problem have been found to be NP-complete, and thus finding the exact solutions is computationally intractable for large-scaled problems. This paper presen...
متن کاملEfficient Parallel Iterated Greedy Algorithm for Solving Task Assignment Problem in Heterogeneous Systems
Efficient allocation or assignment of tasks has been a constant problem for research in the domain of Combinatorial Optimization. With Task Assignment being an NP-Hard Problem for more than 3 processors, considerable effort has gone into developing heuristic algorithms that provide an efficient and approximate solutions that match the expected values. Currently trending algorithms utilize Graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Scientific Research in Computer Science, Engineering and Information Technology
سال: 2020
ISSN: 2456-3307
DOI: 10.32628/cseit2063106